Drawing Graphs on a Smartphone

نویسندگان

  • Giordano Da Lozzo
  • Giuseppe Di Battista
  • Francesco Ingrassia
چکیده

We present a system for the visualization of information modeled in terms of a graph on a smartphone. First, we show the adopted visualization paradigm, that allows the user to navigate the graph using a focus-based approach. Second, we tackle the algorithmic challenges posed by the new visualization paradigm, introducing and experimenting effective heuristics. Finally, we show several customizations of the system aimed at exploring and at visualizing popular Web contents like social networks and Wikipedia. Current implementations include the iPhone and the Google Android platforms. Submitted: January 2011 Reviewed: July 2011 Revised: November 2011 Accepted: November 2011 Final: November 2011 Published: January 2012 Article type: Regular paper Communicated by: U. Brandes and S. Cornelsen Research supported in part by MIUR (Italy), Projects AlgoDEEP no. 2008TFBWL4 and FIRB “Advanced tracking system in intermodal freight transportation”, no. RBIP06BZW8. E-mail addresses: [email protected] (Giordano Da Lozzo) [email protected] (Giuseppe Di Battista) [email protected] (Francesco Ingrassia) 110 Da Lozzo et al. Drawing Graphs on a Smartphone

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Finding Non-Planar Rectilinear Drawings of Graphs

Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with ...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Optical Graph Recognition

Graphs are an important model for the representation of structural information between objects. One identifies objects and nodes as well as a binary relation between objects and edges. Graphs have many uses, e. g., in social sciences, life sciences and engineering. There are two primary representations: abstract and visual. The abstract representation is well suited for processing graphs by com...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

Algorithms for Drawing Plane Graphs

Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graph Algorithms Appl.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2010